Proper and unit tolerance graphs
نویسندگان
چکیده
منابع مشابه
Proper and Unit Tolerance Graphs
We answer a question of Golumbic, Monma and Trotter by constructing proper tolerance graphs that are not unit tolerance graphs. An infinite family of graphs that are minimal in this respect is specified.
متن کاملProper and unit bitolerance orders and graphs
We say any order ~ is a tolerance order on a set of vertices if we may assign to each vertex x an interval Ix of real numbers and a real number tx called a tolerance in such a way that x~,y if and only if the overlap of Ix and ly is less than the minimum of t~ and ty and the center of I~ is less than the center of Iy. An order is a bitolerance order if and only if there are intervals Ix and rea...
متن کاملThe Roberts characterization of proper and unit interval graphs
In this note, a constructive proof that the classes of proper interval graphs and unit interval graphs coincide is given, a result originally established by Fred S. Roberts. Additionally, the proof yields a linear-time and space algorithm to compute a unit interval representation, given a proper interval graph as input. © 2007 Elsevier B.V. All rights reserved.
متن کاملCertifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
We give two new algorithms for recognizing proper circulararc graphs and unit circular-arc graphs. The algorithms either provide a model for the input graph, or a certificate that proves that such a model does not exist and can be authenticated in O(n) time.
متن کاملProper connection of graphs
An edge-colored graph G is k-proper connected if every pair of vertices is connected by k internally pairwise vertex-disjoint proper colored paths. The k-proper connection number of a connected graph G, denoted by pck(G), is the smallest number of colors that are needed to color the edges ofG in order tomake it k-proper connected. In this paperweprove several upper bounds for pck(G). We state s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00044-e